On building the transitive reduction of a two-dimensional posetNARDELLI, E; MASTROBUONI, V; SANTOMO, A et al.Information processing letters. 1997, Vol 63, Num 1, pp 9-12, issn 0020-0190Article

On the transition graphs of Turing machinesCAUCAL, Didier.Lecture notes in computer science. 2001, pp 177-189, issn 0302-9743, isbn 3-540-42121-1Conference Paper

More on structure-ranks of matricesBRUALDI, R. A; MASSEY, J. J. Q.Linear algebra and its applications. 1993, Vol 183, pp 193-199, issn 0024-3795Article

A class of non-Cayley vertex-transitive graphs associated with PSL(2,p)MARUSIC, D; SCAPELLATO, R.Discrete mathematics. 1992, Vol 109, Num 1-3, pp 161-170, issn 0012-365XArticle

Fast discrete polynomial transforms with applications to data analysis for distance transitive graphsDRISCOLL, J. R; HEALY, D. M; ROCKMORE, D. N et al.SIAM journal on computing (Print). 1997, Vol 26, Num 4, pp 1066-1099, issn 0097-5397Article

Short resolution proofs for a sequence of tricky formulasSTALMARCK, G.Acta informatica. 1996, Vol 33, Num 3, pp 277-280, issn 0001-5903Article

On restricted edge-connectivity of graphsXU, Jun-Ming; XU, Ke-Li.Discrete mathematics. 2002, Vol 243, Num 1-3, pp 291-298, issn 0012-365XArticle

Random walks on edge transitive graphsPALACIOS, J. L; RENOM, J. M.Statistics & probability letters. 1998, Vol 37, Num 1, pp 29-34, issn 0167-7152Article

Multiply-twisted hypercube with five or more dimensions is not vertex-transitivePRIYALAL KULASHINGHE; BBETTAYEB, S.Information processing letters. 1995, Vol 53, Num 1, pp 33-36, issn 0020-0190Article

Combinatorial properties of dependence graphsEHRENFEUCHT, A; HOOGEBOOM, H. J; ROZENBERG, G et al.Information and computation (Print). 1994, Vol 114, Num 2, pp 315-328, issn 0890-5401Article

Encadrement de l'indice de Slater d'un tournoi à l'aide de ses scores = Bounds of Slater's index of a tournament from its scoresCHARON-FOURNIER, I; GERMA, A; HUDRY, O et al.Mathématiques, informatique et sciences humaines. 1992, Num 118, pp 53-68, issn 0995-2314Article

On transitive Cayley graphs of strong semilattices of right (left) groups : Graph asymmetriesPANMA, S; KNAUER, U; ARWORN, Sr et al.Discrete mathematics. 2009, Vol 309, Num 17, pp 5393-5403, issn 0012-365X, 11 p.Article

Generalizing the generalized Petersen graphsSARAZIN, Marko Lovrecic; PACCO, Walter; PREVITALI, Andrea et al.Discrete mathematics. 2007, Vol 307, Num 3-5, pp 534-543, issn 0012-365X, 10 p.Article

Voting paradoxes and digraphs realizationsALON, Noga.Advances in applied mathematics (Print). 2002, Vol 29, Num 1, pp 126-135, issn 0196-8858Article

Vertex-transitive graphs and accessibilityTHOMASSEN, C; WOESS, W.Journal of combinatorial theory. Series B. 1993, Vol 58, Num 2, pp 248-268, issn 0095-8956Article

Tisser le chaos = Weaving chaosRU, A.Mathématiques, informatique et sciences humaines. 1993, Num 124, pp 39-56, issn 0995-2314Article

Evolution of cooperation in a finite homogeneous graphTAYLOR, Peter D; DAY, Troy; WILD, Geoff et al.Nature (London). 2007, Vol 447, Num 7143, pp 469-472, issn 0028-0836, 4 p.Article

An infinite family of cubic edge- but not vertex-transitive graphsMALNIC, Aleksander; MARUSIC, Dragan; POTOCNIK, Primoz et al.Discrete mathematics. 2004, Vol 280, Num 1-3, pp 133-148, issn 0012-365X, 16 p.Article

Largest graphs of diameter 2 and maximum degree 6MOLODTSOV, S. G.General theory of information transfer and combinatorics. Lecture notes in computer science. sd, pp 853-857, issn 0302-9743, isbn 3-540-46244-9, 1Vol, 5 p.Book Chapter

A note on the finite collision property of random walksDAYUE CHEN; BEI WEI; FUXI ZHANG et al.Statistics & probability letters. 2008, Vol 78, Num 13, pp 1742-1747, issn 0167-7152, 6 p.Article

Partitions and orientations of the rado graphDIESTEL, Reinhard; LEADER, Imre; SCOTT, Alex et al.Transactions of the American Mathematical Society. 2007, Vol 359, Num 5, pp 2395-2405, issn 0002-9947, 11 p.Article

A splitting theorem for transitive mapsALSEDA, L; DEL RIO, M. A; RODRIGUEZ, J. A et al.Journal of mathematical analysis and applications. 1999, Vol 232, Num 2, pp 359-375, issn 0022-247XArticle

Critical percolation on any nonamenable group has no infinite clustersBENJAMINI, I; LYONS, R; PERES, Y et al.Annals of probability. 1999, Vol 27, Num 3, pp 1347-1356, issn 0091-1798Article

On transmitting delay in a distance-transitive strongly antipodal graphJUNG-SING JWO; TAI-CHING TUAN.Information processing letters. 1994, Vol 51, Num 5, pp 233-235, issn 0020-0190Article

Predecessor property, full combinatorial column rank, and the height characteristic of an M-matrixBRU, R; CANTO, R; BIT-SHUN TAM et al.Linear algebra and its applications. 1993, Vol 183, pp 1-22, issn 0024-3795Article